STEEPEST DESCENT ON REAL FLAG MANIFOLDS

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Steepest descent on real flag manifolds

Among the compact homogeneous spaces, a very distinguished subclass is formed by the (generalized) real flag manifolds which by definition are the orbits of the isotropy representations of Riemannian symmetric spaces (sorbits). This class contains most compact symmetric spaces (e.g. all hermitian ones), all classical flag manifolds over real, complex and quaternionic vector spaces, all adjoint ...

متن کامل

Steepest descent method for quasiconvex minimization on Riemannian manifolds

This paper extends the full convergence of the steepest descent algorithm with a generalized Armijo search and a proximal regularization to solve quasiconvex minimization problems defined on complete Riemannian manifolds. Previous convergence results are obtained as particular cases of our approach and some examples in non Euclidian spaces are given.

متن کامل

Real Groups Transitive on Complex Flag Manifolds

Let Z = G/Q be a complex flag manifold. The compact real form Gu of G is transitive on Z. If G0 is a noncompact real form, such transitivity is rare but occasionally happens. Here we work out a complete list of Lie subgroups of G transitive on Z and pick out the cases that are noncompact

متن کامل

Steepest Descent

The steepest descent method has a rich history and is one of the simplest and best known methods for minimizing a function. While the method is not commonly used in practice due to its slow convergence rate, understanding the convergence properties of this method can lead to a better understanding of many of the more sophisticated optimization methods. Here, we give a short introduction and dis...

متن کامل

Steepest descent on factor graphs

x f(x, θ) log f(x, θ) exists for all θ and θ. In principle, one can apply the sum-product algorithm in order to find (1), which involves the following two steps [2]: 1. Determine f(θ) by sum-product message passing. 2. Maximization step: compute θmax △ = argmaxθ f(θ). This procedure is often not feasible, since • When the variable x is continuous, the sum-product rule may lead to intractable in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bulletin of the London Mathematical Society

سال: 2006

ISSN: 0024-6093,1469-2120

DOI: 10.1112/s0024609306018376